Title: Petersen graph is the only snark fully covered by short cycles

Abstract: We prove that Petersen graph is the only snark (i.e.,
non-3-edge-colorable connected cubic graph) in which every edge lies in a
cycle of length at most five.
This is a joint work with František Kardoš and Robert Lukoťka.